package com.datastructure.binarytree;

import java.util.List;

/**
 * @author: 临晖
 * @date: 2023/10/22
 * @description:
 */
public class Node {
    public int val;
    public List<Node> children;

    public Node() {
    }

    public Node(int _val) {
        val = _val;
    }

    public Node(int _val, List<Node> _children) {
        val = _val;
        children = _children;
    }

    //public int val;
    public Node left;
    public Node right;
    public Node next;

    //public Node() {
    //}
    //
    //public Node(int _val) {
    //    val = _val;
    //}

    public Node(int _val, Node _left, Node _right, Node _next) {
        val = _val;
        left = _left;
        right = _right;
        next = _next;
    }


}
